TETRA直通模式移动台协议仿真

作为 TETRA 通信的一种方式,TETRA DMO 使得 TETRA 移动台在没有设置基站以及基站覆盖范围之外的地区、系统出现故障或过载以至难以快速接人时可以不经过网络基础设施直接进行相互的通信,从而降低了移动台通信对基站的依赖性,扩展了移动台通信的地理范围。文中首先依照协议对直通模式移动台通信方式和呼叫接续过程进行了介绍,并描述了利用工具 SDL and TTCN suite 4.5对其中的电路模式呼叫流程编程、仿真的过程,最后对仿真的结果进行了简要说明。     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016     

针对官兵能力个体差异做好部队训练工作

正确认识能力的多样性及个体差异,有利于增强部队训练工作的科学性,提高战斗力。由于“能力”理解的多样性,对部队训练能力的认识也具有多个层面的涵义。个体在部队训练中体现出发展水平、结构、表现时间以及性别的差异。正确认识这些差异需要走出认知上的误区,做好“两头人”的工作,充分发挥“三互小组”的作用以及制定不同阶段的具体目标等。     

经济视角下的《骆驼祥子》

老舍在《骆驼祥子》中采用经济视角,与自身的生活经历和时代背景有关。通过在作品中运用经济视角探究人的解放、展开社会批判、进行伦理剖析,比较客观地还原了生活的本真和人生的本相,让读者透视了经济生活表象下蕴含的精神内涵。     

Improved bounds for batch scheduling with nonidentical job sizes

Here, we revisit the bounded batch scheduling problem with nonidentical job sizes on single and parallel identical machines, with the objective of minimizing the makespan. For the single machine case, we present an algorithm which calls an online algorithm (chosen arbitrarily) for the one‐dimensional bin‐packing problem as a sub‐procedure, and prove that its worst‐case ratio is the same as the absolute performance ratio of . Hence, there exists an algorithm with worst‐case ratio , which is better than any known upper bound on this problem. For the parallel machines case, we prove that there does not exist any polynomial‐time algorithm with worst‐case ratio smaller than 2 unless P = NP, even if all jobs have unit processing time. Then we present an algorithm with worst‐case ratio arbitrarily close to 2. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 351–358, 2014     

MFSK/FFH系统分集合并算法性能对比研究

推导了部分频带干扰最佳干扰系数表达式并进行了仿真验证,描述了多进制频移键控/快跳频(MFSK/FFH)系统、衰落信道和分集合并算法模型,在最坏部分频带干扰和衰落信道下,仿真对比了MFSK/FFH系统采用线性分集合并、限幅线性分集合并、自归一分集合并、排序统计自归一分集合并、乘积分集合并5种分集合并算法时的误码率性能,结果表明:在最坏部分频带干扰和衰落信道下,线性合并性能较差,其他4种算法性能较为相似,Rayleigh衰落信道中排序统计自归一分集合并和乘积分集合并算法性能最优。     

Two‐machine flow shop no‐wait scheduling with a nonavailability interval

We study a two‐machine flow shop scheduling problem with no‐wait in process, in which one of the machines is not available during a specified time interval. We consider three scenarios of handing the operation affected by the nonavailability interval. Its processing may (i) start from scratch after the interval, or (ii) be resumed from the point of interruption, or (iii) be partially restarted after the interval. The objective is to minimize the makespan. We present an approximation algorithm that for all these scenarios delivers a worst‐case ratio of 3/2. For the second scenario, we offer a 4/3‐approximation algorithm. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

车辆装备保障分队单兵训练质量组合评价分析

针对当前部队车辆装备保障分队单兵训练质量评价中所存在的问题和不足,综合运用集对分析一四元联系数理论、马尔可夫链模型和熵权双基点法,尝试提出一种新的评价分析方法——SHE组合评价分析法,排除单兵原有基础差异对年度训练考核成绩的影响,考虑评价对象之间的情感因素和分队训练条件对单兵训练质量的影响,从而使评价显得更加客观、公正和公平．最后,结合算例,分析说明了此方法的具体应用．     

Bin‐packing problem with concave costs of bin utilization

We consider a generalized one‐dimensional bin‐packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin‐packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst‐case performances when they are applied to our model. The absolute worst‐case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

一种含最优变异的多微粒群优化算法

针对微粒群优化算法中的固有缺点,提出了带有最优变异算子的多微粒群优化算法,采用多个微粒群对目标函数进行寻优,并在寻优过程中对子群中最优微粒引入了最优变异算子。通过这样的处理,算法可以预防早熟收敛并具有更快的收敛速度和更好的局部开发能力。对一组测试函数的模拟实验结果表明,带最优变异的多微粒群优化算法可以摆脱局部最优解对微粒的吸引,在较少的代数内就能够获得好的优化结果。